Mergelyan's Theorem on Uniform Polynomial Approximation.
نویسندگان
چکیده
منابع مشابه
Thomson’s Theorem on Mean Square Polynomial Approximation
In 1991, J. E. Thomson determined completely the structure of H2(μ), the closed subspace of L2(μ) that is spanned by the polynomials, whenever μ is a compactly supported measure in the complex plane. As a consequence he was able to show that if H2(μ) = L2(μ), then every function f ∈ H2(μ) admits an analytic extension to a fixed open set Ω, thereby confirming in this context a phenomenon noted e...
متن کاملBest Uniform Approximation 3 Theorem 1
We present a Chebyshev-type characterization for the best uniform approximations of periodic continuous functions by functions of the class M = ff(x) : f(x) = Z 2 0 K(x; y)h(y) dy; jh(y)j 1 a: e:; y 2 0; 2)g; where K(x; y) is a strictly cyclic variation diminishing kernel. x1 Introduction Let W r 1 a; b] be the Sobolev class of functions in C r?1 a; b] whose (r?1)st derivative is absolutely con...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملA method to obtain the best uniform polynomial approximation for the family of rational function
In this article, by using Chebyshev’s polynomials and Chebyshev’s expansion, we obtain the best uniform polynomial approximation out of P2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. Using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...
متن کاملA Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
We present a polynomial approximation scheme for the minimum makespan problem on uniform parallel processors. More specifically, the problem is to find a schedule for a set of independent jobs on a collection of machines of different speeds so that the last job to finish is completed as quickly as possible. We give a family of polynomial-time algorithms {A} such that A delivers a solution that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1964
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-10741